On the Migration Decision of IT-Graduates: A Two-Level Nested Logit Model
نویسندگان
چکیده
منابع مشابه
A greedy algorithm for the two-level nested logit model
We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment and develop a simple and fast greedy algorithm that iteratively removes at most one product from each nest to compute an optimal solution.
متن کاملa study on construction of iranian life tables: the case study of modified brass logit system
چکیده ندارد.
15 صفحه اولTechnical Note: A Simple Greedy Algorithm for Assortment Optimization in the Two-Level Nested Logit Model
We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment, and use this optimality condition to develop a simple greedy algorithm that iteratively removes at most one product from each nest, until the optimality condition is satisfied. Our algorithm also exploits the beautiful “l...
متن کاملThe Generalized Nested Logit Model
The generalized nested logit model is a new member of the generalized extreme value family of models. The GNL provides a higher degree of flexibility in the estimation of substitution or cross-elasticity between pairs of alternatives than previously developed generalized extreme value models. The generalized nested logit model includes the paired combinatorial logit and cross-nested logit model...
متن کاملa study on insurer solvency by panel data model: the case of iranian insurance market
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2003
ISSN: 1556-5068
DOI: 10.2139/ssrn.558202